Semidefinite programming for permutation codes
نویسندگان
چکیده
منابع مشابه
Semidefinite programming for permutation codes
We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the conjugacy scheme of the symmetric group Sym(n). In particular, we compute orbits of ordered pairs on Sym(n) acted upon by conjugation and inversion, explore a block di-agonalization of the associated algebra, and obtain improved upper bounds on the size M (n, d) of permutation codes of lengths u...
متن کاملBounds for projective codes from semidefinite programming
We apply the semidefinite programming method to derive bounds for projective codes over a finite field.
متن کاملBounds for Codes by Semidefinite Programming
Delsarte’s method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that using as variables power sums of distances this problem can be considered as a finite semidefinite programming problem. This method allows to improve some l...
متن کاملStrengthened semidefinite programming bounds for codes
We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras. The Delsarte ...
متن کاملUniqueness of codes using semidefinite programming
For n, d, w ∈ N, let A(n, d, w) denote the maximum size of a binary code of word length n, minimum distance d and constant weight w. Schrijver recently showed using semidefinite programming that A(23, 8, 11) = 1288, and the second author that A(22, 8, 11) = 672 and A(22, 8, 10) = 616. Here we show uniqueness of the codes achieving these bounds. Let A(n, d) denote the maximum size of a binary co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2014
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.03.002